Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets
نویسندگان
چکیده
In a canonical way we establish an AZ{identity (see [9]) and its consequences, the LYM{inequality and the Sperner{property, for the Boolean interval lattice. Further, the Bollobas{inequality for the Boolean interval lattice turns out to be just the LYM{ inequality for the Boolean lattice. We also present an Intersection Theorem for this lattice. Perhaps more surprising is that by our approach the conjecture of Peter Erdos, Seress, Sz ekely [1] and F uredi concerning an Erdos{Ko{Rado{type intersection property for the poset of Boolean chains could also be established. Actually we give two seemingly elegant proofs.
منابع مشابه
Regularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملDecomposition theorem for the cd-index of Gorenstein* posets
We prove a decomposition theorem for the cd-index of a Gorenstein* poset analogous to the decomposition theorem for the intersection cohomology of a toric variety. From this we settle a conjecture of Stanley that the cd-index of Gorenstein* lattices is minimized on Boolean algebras.
متن کاملDIRECTLY INDECOMPOSABLE RESIDUATED LATTICES
The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...
متن کاملA bijection between intervals in the Fibonacci posets
For each word w in the Fibonacci lattices Fib(r) and Z (r) we partition the interval ^ 0; w] in Fib(r) into subposets called r-Boolean posets. In the case r = 1 those subposets are isomorphic to Boolean algebras. We also partition the interval ^ 0; w] in Z (r) into certain spanning trees of the r-Boolean posets. A bijection between those intervals is given in which each r-Boolean poset in Fib(r...
متن کاملPosets That Locally Resemble Distributive Lattices
Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a distributive lattice and that, for every interval of rank at least 4, the interval minus its endpoints is connected. It is shown that P is a distributive lattice, thus resolving an issue raised by Stanley. Similar theorems are proven for semimodular, modular, and complemented modular lattices. As a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 1996